GAUSS: An Automatic Algorithm Selection System for Quadrature
نویسندگان
چکیده
This paper introduces GAUSS a system for the automatic selection of quadrature routines in numerical computation. Given a problem in numerical integration and constraints on time and accuracy, GAUSS comes up with an efficient algorithm to solve it. It banks on a performance database of various algorithms and test problems, an automatic feature identification module and a knowledge methodology that represents information about the numerical domain in terms of predicate rules. Inductive Logic Programming is used to induce learning and make inferences in this domain. Experimental Results are presented. It is found that GAUSS comes up with several heuristics that have been earlier formulated by the domain experts.
منابع مشابه
Gauss: an Online Algorithm Selection System for Numerical Quadrature
We describe the design and implementation of GAUSS Ð an online algorithm selection system for numerical quadrature. Given a quadrature problem and performance constraints on its solution, GAUSS selects the best (or nearly best) algorithm. GAUSS uses inductive logic programming to generalize a database of performance data; this produces high-level rules that correlate problem features with algor...
متن کاملStieltjes Polynomials and the Error of Gauss-kronrod Quadrature Formulas
The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the Gauss-Kronrod scheme. An essential progress was made only recently, based on new bounds and as-ymptotic properties for the S...
متن کاملFast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights
An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss– Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton’s root-finding method with initial guesses and function evaluations computed via asymptotic formulae. The n-point quadrature rule is computed in O(n) operations to an accuracy of essentially double precision for any n ≥ 100.
متن کاملStable Computation of High Order Gauss Quadrature Rules Using Discretization for Measures in Radiation Transfer
The solution of the radiation transfer equation for the Earth's atmosphere needs to account for the re ectivity of the ground. When using the spherical harmonics method, the solution for this term involves an integral with a particular measure that presents numerical challenges. We are interested in computing a high order Gauss quadrature rule for this measure. We show that the two classical al...
متن کاملAcceleration of Gauss-legendre Quadrature for an Integrand with an Endpoint Singularity
An asymptotic error expansion for Gauss-Legendre quadrature is derived for an integrand with an endpoint singularity. It permits convergence acceleration by extrapolation.
متن کامل